Improved Belief Propagation List Decoding for Polar Codes
نویسندگان
چکیده
Polar codes have become the channel coding scheme for control of enhanced mobile broadband in 5G communication systems. Belief propagation (BP) decoding polar has advantages low latency and high parallelism but achieves worse bit error ratio (BER) performance compared with successive cancellation list (SCL) scheme. In this paper, an improved BP (IBPL) algorithm is proposed comparable BER to SCL algoritm. Firstly, optimal permuted factor graph analyzed codes, which improves decoder without path extension. Furthermore, based on graph, metric are extend prune path. The IBPL focused not only permutation also reliabilities decoded codewords during each iteration decoding, a more accurate list. simulation results show that original significantly, can approach at signal noise regions.
منابع مشابه
Sparse Graphs for Belief Propagation Decoding of Polar Codes
We describe a novel approach to interpret a polar code as a low-density parity-check (LDPC)-like code with an underlying sparse decoding graph. This sparse graph is based on the encoding factor graph of polar codes and is suitable for conventional belief propagation (BP) decoding. We discuss several pruning techniques based on the check node decoder (CND) and variable node decoder (VND) update ...
متن کاملBelief Propagation Decoding of Polar Codes on Permuted Factor Graphs
We show that the performance of iterative belief propagation (BP) decoding of polar codes can be enhanced by decoding over different carefully chosen factor graph realizations. With a genie-aided stopping condition, it can achieve the successive cancellation list (SCL) decoding performance which has already been shown to achieve the maximum likelihood (ML) bound provided that the list size is s...
متن کاملHardware Architecture for List SC Decoding of Polar Codes
We present a hardware architecture and algorithmic improvements for list SC decoding of polar codes. More specifically, we show how to completely avoid copying of the likelihoods, which is algorithmically the most cumbersome part of list SC decoding. The hardware architecture was synthesized for a blocklength of N = 1024 bits and list sizes L = 2, 4 using a UMC 90nm VLSI technology. The resulti...
متن کاملImproved Turbo Decoding through Belief Propagation
Absfract-It has long been recognized that graphical representations of parallel concatenated codes contain loops. These loops make it extremely difficult to use the standard, probabilistic methods for graphs to obtain any insight as to the functionality of turbo decoding. Graphbased techniques do, however, lead to useful extensions and generalizations of the turbo decoding concept. In this pape...
متن کاملSome problems of Graph Based Codes for Belief Propagation decoding
A) , (L J regular QC-LDPC code of length N is defined by a parity-check matrix L L p I p I p I p I p I p I p I p I p I H (1) where 1 1 J j , 1 1 L l and l j p I , represents the p p circulant permutation matrix obtained by cyclically right-shifting the p p identity matrix 0 I by l j p , positions, with. / L N p For a specific QC-LDPC code we define the correspo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2022
ISSN: ['2079-9292']
DOI: https://doi.org/10.3390/electronics11152458